Breaking Symmetries in Distributed Constraint Programming Problems
نویسندگان
چکیده
Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method forAdopt andDpop algorithms for some instances of the SensorDCSP problem, to find our symmetry breaker improve their performance up to 1.7 and 1.8 times respectively.
منابع مشابه
An approach to Symmetry Breaking in Distributed Constraint Satisfaction Problems
Symmetry breaking in Distributed Constraint Satisfaction Problems (DisCSPs) has, to the best of our knowledge, not been investigated. In this paper, we show that most symmetries in DisCSPs are actually weak symmetries, and we demonstrate howweak symmetry breaking techniques can be applied to DisCSPs.
متن کاملSymmetry Breaking for Answer Set Programming
In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. The corr...
متن کاملAn Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking methods. However, this combination does not break all symmetries in general. We present a combination of lex constraints and element constraints that can be used to break all combinations of variable and value symmetri...
متن کاملDetecting and breaking symmetries on specifications
In this paper we address symmetry on combinatorial problems by following the approach of imposing additional symmetry-breaking constraints. Differently from other works in the literature, we attack the problem at the specification level. In fact, sometimes symmetries on specifications can be very easily detected, and symmetry-breaking formulae generated. We give formal definitions of symmetries...
متن کاملGroups and Constraints: Symmetry Breaking during Search
We present an interface between the ECLPS constraint logic programming system and the GAP computational abstract algebra system. The interface provides a method for efficiently dealing with large numbers of symmetries of constraint satisfaction problems for minimal programming effort. We also report an implementation of SBDS using the GAP-ECLPS interface which is capable of handling many more s...
متن کامل